Hinged Dissection of Polyominoes and Polyforms

نویسندگان

  • Erik D. Demaine
  • Martin L. Demaine
  • David Eppstein
  • Greg N. Frederickson
  • Erich Friedman
چکیده

A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a polygon P that join corresponding edges of P . This construction uses kn pieces, where k is the number of vertices of P . When P is a regular polygon, we show how to reduce the number of pieces to dk=2e(n 1). In particular, we consider polyominoes (made up of unit squares), polyiamonds (made up of equilateral triangles), and polyhexes (made up of regular hexagons). We also give a hinged dissection of all polyabolos (made up of right isosceles triangles), which do not fall under the general result mentioned above. Finally, we show that if P can be hinged into Q, then any edge-to-edge gluing of n congruent copies of P can be hinged into any edge-to-edge gluing of n congruent copies of Q.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hinged dissections of polyominoes and polyforms

This paper shows how to hinge together a collection of polygons at vertices in such a way that a single object can be reshaped into any n-omino, for a given value of n. An n-omino is de ned generally as a connected union of n unit squares on the integer grid. Our best dissection uses 2(n 1) polygons. We generalize this result to the connected unions of nonoverlapping equal-size regular k-gons j...

متن کامل

My Parade of Algorithmic Mathematical Art

Animations are discussed for a range of geometric dissections. These include a variety of twist-hinged dissections, some swing-hinged dissections, dissections of squares and cubes corresponding to a certain integer identities, folding dissections of multi-level regular polygons, and folding dissections of multi-level polyominoes. Artistic issues pertaining to these dissections and animations ar...

متن کامل

Nested reconfigurable robots: theory, design, and realization

Rather than the conventional classification method, we propose to divide modular and reconfigurable robots into intra-, inter-, and nested reconfigurations. We suggest designing the robot with nested reconfigurability, which utilizes individual robots with intra-reconfigurability capable of combining with other homogeneous/heteroge‐ neous robots inter-reconfigurability . The objective of this a...

متن کامل

Polyhedral Characterization of Reversible Hinged Dissections

We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection that reverses inside and outside boundaries when folding between A and B) if and only if A and B are two non-crossing nets of a common polyhedron. Furthermore, monotone hinged dissections (where all hinges rotate in the same direction when changing from A to B) correspond exactly to non-crossing ne...

متن کامل

Hinged Kite Mirror Dissection

Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open whether such a hinged dissection always exists. We solve a special case of this problem, by showing that any asymmetric polygon always has a hinged dissection to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999